Quantile Inverse Optimization: Improving Stability in Inverse Linear Programming

نویسندگان

چکیده

Although inverse linear programming (LP) has received increasing attention as a technique to identify an LP that can reproduce observed decisions are originally from complex system, the performance of objective function inferred by existing methods is often highly sensitive noise, errors, and uncertainty in underlying decision data. Inspired robust regression techniques mitigate impact noisy data on model fitting, “Quantile Inverse Optimization: Improving Stability Linear Programming,” Shahmoradi Lee propose notion stability develop optimization identities functions stable against imperfection. such consideration renders large-scale mixed-integer program, authors analyze connection between well-known biclique problems efficient exact algorithm well heuristics.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inverse Stochastic Linear Programming

Inverse optimization perturbs objective function to make an initial feasible solution optimal with respect to perturbed objective function while minimizing cost of perturbation. We extend inverse optimization to two-stage stochastic linear programs. Since the resulting model grows with number of scenarios, we present two decomposition approaches for solving these problems.

متن کامل

Inverse Linear Programming in DEA

Despite the large uses of inverse DEA models, there is not any single application of inverse linear programming in DEA when the definition of inverse linear programming is taken under account. Thus the goal of this paper is applying the inverse linear programming into DEA field, and to provide a streamlined approach to DEA and Additive model. Having the entire efficient DMUs in DEA models is a...

متن کامل

Inverse optimization in countably infinite linear programs

Given the costs and a feasible solution for a linear program, inverse optimization involves finding new costs that are close to the original ones and make the given solution optimal. We develop an inverse optimization framework for countably infinite linear programs using the weighted absolute sum metric. We reformulate this as an infinite-dimensional mathematical program using duality. We prop...

متن کامل

Inverse linear programming with interval coefficients

The paper deals with the inverse linear programming problem over intervals. More precisely, given interval domains for the objective function coefficients and constraint coefficients of a linear program, we ask for which scenario a prescribed optimal value is attained. Using continuity of the optimal value function (under some assumptions), we propose a method based on parametric linear program...

متن کامل

Inverse barrier methods for linear programming

In the recent interior point methods for linear programming much attention has been given to the logarithmic barrier method. In this paper we will analyse the class of inverse barrier methods for linear programming, in which the barrier is P x r i , where r > 0 is the rank of the barrier. There are many similarities with the logarithmic barrier method. The minima of an inverse barrier function ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 2022

ISSN: ['1526-5463', '0030-364X']

DOI: https://doi.org/10.1287/opre.2021.2143